Channel Assignment on Infinite Sets under Frequency-Distance Constraints

نویسنده

  • J. van den Heuvel
چکیده

Large-scale radio systems for multiple users, such as those used in mobile phone networks, are often based on a cellular structure (Hale 1980; Macario 1997; MacDonald 1979). The service area is divided into cells and each cell is serviced by one transmitter, which communicates with users within the cell using a particular radio channel or set of channels. In any particular application the available channels are uniformly spaced in the spectrum, justifying integer labellings of these channels. It is often assumed, at least as a starting position, that the transmitters all have the same power, are omnidirectional, and are laid out like the vertices of a triangular lattice: in this case, the natural cells form a hexagonal pattern. Suppose that a radio receiver is tuned to a signal on channel c0, broadcast by the transmitter for its cell (typically, the closest transmitter). Reception will be degraded if there is excessive interference from other transmitters in the vicinity. First there is ‘co-channel’ interference due to re-use of channel c0 at nearby sites; but there are also contributions from sites using channels near c0, since in practice neither transmitters nor receivers operate exclusively within the frequencies of their assigned channels. One possible method to decide if an assignment of channels to transmitters is acceptable is as follows. First we agree on a suitable radio propagation model, and a collection of ‘test’ receiver positions. We then combine the effects of co-channel interference and other interferences at the test receiver positions, and determine whether the corresponding signal to interference ratios

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Gaussian Z Channel with Intersymbol Interference

In this paper, we derive a capacity inner bound for a synchronous Gaussian Z channel with intersymbol interference (ISI) under input power constraints. This is done by converting the original channel model into an n-block memoryless circular Gaussian Z channel (n-CGZC) and successively decomposing the n-block memoryless channel into a series of independent parallel channels in the frequency dom...

متن کامل

Convex Generalized Semi-Infinite Programming Problems with Constraint Sets: Necessary Conditions

 We consider generalized semi-infinite programming problems in which the index set of the inequality constraints depends on the decision vector and all emerging functions are assumed to be convex. Considering a lower level constraint qualification, we derive a formula for estimating the subdifferential of the value function. Finally, we establish the Fritz-John necessary optimality con...

متن کامل

Channel Assignment Optimisation Using an Adaptive Heuristic

The rapid development of mobile communications has caused a higher demand of radio channel or carrier frequency due to additional mobile subscribers. With a limited frequency bandwidth allocated to mobile operators, good network planning is important to avoid congestion in the network. Some of the methods used to improve congestion in mobile networks is cell splitting and frequency reuse, but w...

متن کامل

A Two-Threshold Guard Channel Scheme for Minimizing Blocking Probability in Communication Networks

In this paper, we consider the call admission problem in cellular network with two classes of voice users. In the first part of paper, we introduce a two-threshold guard channel policy and study its limiting behavior under the stationary traffic. Then we give an algorithm for finding the optimal number of guard channels. In the second part of this paper, we give an algorithm, which minimizes th...

متن کامل

1 Channel assignment and graph multicoloring

Cellular data and communication networks are usually modeled as graphs with each node representing a base station in a cell in the network, and edges representing geographical adjacency of cells. The problem of channel assignment in such networks can be seen as a graph multicoloring problem. We survey the models, algorithms, and lower bounds for this problem. — 1.1 INTRODUCTION In a cellular ne...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001